This paper deals with the study of the queue model D-MAP/GY /1/M. This is a single server system which is modelled as a discrete time system and is characterised by the following assumptions. The arrival process of customers is modelled by a discrete- time Markovian arrival process (D-MAP). The service procedure is described by bulk service times with general distribution GY . Y is the random variable which determines bulk size for service at the starting instant of services. The authors assume that the model behaves as a late arrival system with delayed access (LAS-DA). The arrivals occur during a time slot, just prior to the end of the slot, and the services start at slot boundaries. So a customer which arrives to the queue can start its ...
In this paper we consider a single server queueing model with under general bulk service rule with i...
We consider a single-server discrete-time queueing system with N sources, where each source is model...
In discrete-time queueing theory, the service process is traditionally modeled using the notion of s...
This paper deals with the study of the queue model D-MAP/GY /1/M. This is a single server system whi...
Discrete-time queueing models find a large number of applications as they are used in modeling queue...
To study the effect of burstiness in arrival streams on the congestion in queueing systems this pape...
This paper analyzes a single-server discrete-time queueing model with general independent arrivals, ...
This paper analyzes a discrete-time multi-server queue in which service capacity of each server is a...
A discrete time queueing model is considered to estimate of the number of customers in the system. T...
This paper analyzes a single-server discrete-time queueing model with general independent arrivals, ...
We consider a finite capacity single server queue in which the customers arrive according to a Marko...
AbstractIn this paper, we consider the discrete-time single-server finite-buffer late arrival with d...
We consider a single-server discrete queucing system in which arrivals occur according to a Markovia...
We consider a discrete-time queueing model whereby the service capacity of the system, i.e., the num...
Vacation time queues with Markovian arrival process (MAP) are mainly useful in mod-eling and perform...
In this paper we consider a single server queueing model with under general bulk service rule with i...
We consider a single-server discrete-time queueing system with N sources, where each source is model...
In discrete-time queueing theory, the service process is traditionally modeled using the notion of s...
This paper deals with the study of the queue model D-MAP/GY /1/M. This is a single server system whi...
Discrete-time queueing models find a large number of applications as they are used in modeling queue...
To study the effect of burstiness in arrival streams on the congestion in queueing systems this pape...
This paper analyzes a single-server discrete-time queueing model with general independent arrivals, ...
This paper analyzes a discrete-time multi-server queue in which service capacity of each server is a...
A discrete time queueing model is considered to estimate of the number of customers in the system. T...
This paper analyzes a single-server discrete-time queueing model with general independent arrivals, ...
We consider a finite capacity single server queue in which the customers arrive according to a Marko...
AbstractIn this paper, we consider the discrete-time single-server finite-buffer late arrival with d...
We consider a single-server discrete queucing system in which arrivals occur according to a Markovia...
We consider a discrete-time queueing model whereby the service capacity of the system, i.e., the num...
Vacation time queues with Markovian arrival process (MAP) are mainly useful in mod-eling and perform...
In this paper we consider a single server queueing model with under general bulk service rule with i...
We consider a single-server discrete-time queueing system with N sources, where each source is model...
In discrete-time queueing theory, the service process is traditionally modeled using the notion of s...